12317 - Document Compression/12317.3.cpp

   1 // Equipo Poncho, Carriel y Ruana
   2 // Accepted on UVa
   3 using namespace std;
   4 #include <algorithm>
   5 #include <iostream>
   6 #include <iterator>
   7 #include <sstream>
   8 #include <fstream>
   9 #include <cassert>
  10 #include <climits>
  11 #include <cstdlib>
  12 #include <cstring>
  13 #include <string>
  14 #include <cstdio>
  15 #include <vector>
  16 #include <cmath>
  17 #include <queue>
  18 #include <stack>
  19 #include <list>
  20 #include <map>
  21 #include <set>
  22
  23 template <class T> string toStr(const T &x)
  24 { stringstream s; s << x; return s.str(); }
  25 template <class T> int toInt(const T &x)
  26 { stringstream s; s << x; int r; s >> r; return r; }
  27
  28 #define For(i, a, b) for (int i=(a); i<(b); ++i)
  29 #define foreach(x, v) for (typeof (v).begin() x = (v).begin(); x != (v).end(); ++x)
  30 #define D(x) cout << #x " = " << (x) << endl;
  31
  32 const double EPS = 1e-9;
  33
  34 int cmp(double x, double y = 0, double tol = EPS) {
  35     return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1;
  36 }
  37
  38 const int MAXBASES = 105, oo = 1 << 28;
  39 int bases[MAXBASES];
  40
  41 int B, D;
  42 int dp[1 << 16];
  43
  44 int docSize;
  45
  46 void binary(int x){
  47     for (int i = 0; i < 16; ++i){
  48         printf("%d", !!(x & (1 << i)));
  49     }
  50 }
  51
  52 void precompute(){
  53     for (int mask = 0; mask < (1 << 16); ++mask) {
  54         dp[mask] = oo;
  55     }
  56     dp[0] = 0;
  57
  58     for (int i = 0; i < B; ++i) {
  59         for (int mask = 0; mask < (1 << 16); ++mask) {
  60             if (dp[mask] >= oo) continue;
  61             int base = bases[i];
  62             dp[mask | base] = min(dp[mask | base], dp[mask] + 1);
  63         }
  64     }
  65 }
  66
  67 int main(){
  68     while (scanf("%d %d", &B, &D) == 2) {
  69         if (B == 0 and D == 0) break;
  70         for (int i = 0; i < B; ++i) {
  71             bases[i] = 0;
  72
  73             int k; scanf("%d", &k);
  74             while (k--) {
  75                 int x; scanf("%d", &x); x--;
  76                 bases[i] |= (1 << x);
  77             }
  78         }
  79         precompute();
  80         for (int j = 0; j < D; ++j) {
  81             int doc = 0;
  82             int k; scanf("%d", &k);
  83             while (k--) {
  84                 int x; scanf("%d", &x); x--;
  85                 doc |= (1 << x);
  86             }
  87
  88             int ans = dp[doc];
  89             if (ans >= oo) ans = 0;
  90             printf("%d", ans);
  91
  92             if (j + 1 < D) printf(" ");
  93         }
  94         puts("");
  95     }
  96     return 0;
  97 }